#define _CRT_SECURE_NO_WARNINGS 

#include"sort.h"


//struct TreeNode
//{
//    char data;
//    struct TreeNode* left;
//    struct TreeNode* right;
//};
//
//
//struct TreeNode* CreateTree(char* a, int* pi)
//{
//    if (a[*pi] == '#')
//    {
//        (*pi)++;
//        return NULL;
//    }
//    struct TreeNode* root = (struct TreeNode*)malloc(sizeof(struct TreeNode));
//    root->data = a[(*pi)++];
//    root->left = CreateTree(a, pi);
//    root->right = CreateTree(a, pi);
//    return root;
//}
//
//void InOreder(struct TreeNode* root)
//{
//    if (root == NULL)
//    {
//        return;
//    }
//    InOreder(root->left);
//    printf("%c ", root->data);
//    InOreder(root->right);
//}
//
//
//int main()
//{
//    char a[100] = "abc##de#g##f###";
//    int i = 0;
//    struct TreeNode* n1=CreateTree(a, &i);
//    InOreder(n1);
//    return 0;
//}
void TestOP()
{
	srand((int)time(0));
	const int N = 100000;
	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);
	int* a5 = (int*)malloc(sizeof(int) * N);
	int* a6 = (int*)malloc(sizeof(int) * N);
	for (int i = 0; i < N; ++i)
	{
		a1[i] = rand();
		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];

	}
	int begin1 = clock();
	//InsertSort(a1, N);
	int end1 = clock();
	int begin2 = clock();
	ShellSort(a2, N);
	int end2 = clock();
	int begin3 = clock();
	//SelectSort(a3, N);
	int end3 = clock();
	int begin4 = clock();
	//HeapSort(a4, N);
	int end4 = clock();
	int begin5 = clock();
	//QuickSort(a5, 0, N - 1);
	int end5 = clock();
	int begin6 = clock();
	//MergeSort(a6, N);
	int end6 = clock();
	printf("InsertSort:%d\n", end1 - begin1);
	printf("ShellSort:%d\n", end2 - begin2);
	printf("SelectSort:%d\n", end3 - begin3);
	printf("HeapSort:%d\n", end4 - begin4);
	printf("QuickSort:%d\n", end5 - begin5);
	printf("MergeSort:%d\n", end6 - begin6);
	free(a1);
	free(a2);
	free(a3);
	free(a4);
	free(a5);
	free(a6);
}

void TestInsertSort()
{
	int arr[] = { 6,8,9,7,5,4,1,0,3,2 };
	int sz = sizeof(arr) / sizeof(arr[0]);

	PrintArray(arr, sz);
	InsertSort(arr, sz);
	PrintArray(arr, sz);

}

void TestShellSort()
{
	int arr[] = { 6,8,9,7,5,4,1,0,3,2,-1,-2,-3,-4,-5,-5,-6,-7,-8,-9,-10 };
	int sz = sizeof(arr) / sizeof(arr[0]);

	PrintArray(arr, sz);
	ShellSort(arr, sz);
	PrintArray(arr, sz);

}

void TestSelectSort()
{
	int arr[] = { 9,8,7,6,5,4,3,2,1,0 };
	int sz = sizeof(arr) / sizeof(arr[0]);

	PrintArray(arr, sz);
	SelectSort(arr, sz);
	PrintArray(arr, sz);

}


void TestBubbleSort()
{
	int arr[] = { 6,8,7,9,6,5,4,3,2,1,0 };
	int sz = sizeof(arr) / sizeof(arr[0]);

	PrintArray(arr, sz);
	BubbleSort(arr, sz);
	PrintArray(arr, sz);

}

void TestQuickSort()
{
	int arr[] = { 6,8,7,9,5,4,3,2,1,0 };
	int sz = sizeof(arr) / sizeof(arr[0]);

	PrintArray(arr, sz);
	QuickSort3(arr,0,sz-1);
	PrintArray(arr, sz);

}



int main()
{
	//TestInsertSort();
	//TestShellSort();
	TestQuickSort();
	//TestOP();
	return 0;
}